Graph Drawing with Algorithm Engineering Methods
نویسندگان
چکیده
This report documents the program and the outcomes of Dagstuhl Seminar 11191 “Graph Drawing with Algorithm Engineering Methods”. We summarize the talks, open problems, and working group discussions. Seminar 8.–13. May, 2011 – www.dagstuhl.de/11191 1998 ACM Subject Classification E.1 Data structures, F.2 Analysis of algorithms and problem complexity, G.1.6 Optimization, G.2.1 Combinatorics, G.2.2 Graph Theory
منابع مشابه
An Experimental Study on Distance-Based Graph Drawing
In numerous application areas, general undirected graphs need to be drawn, and force-directed layout appears to be the most frequent choice. We present an extensive experimental study showing that, if the goal is to represent the distances in a graph well, a combination of two simple algorithms based on variants of multi-dimensional scaling is to be preferred because of their efficiency, reliab...
متن کاملA Framework for Dynamic Graph
Drawing graphs is an important problem that combines avors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: We devise a model for dynamic graph algorithms, based on performing queries and updates on an imp...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملConstraint Programming meets Machine Learning and Data Mining (Dagstuhl Seminar 11201)
Organic Computing – Design of Self-Organizing Systems (Dagstuhl Seminar 11181) Kirstie Bellman, Andreas Herkersdorf, and Michael G. Hinchey . . . . . . . . . . . . . . . . . . 1 Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182) Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, and Ross McConnell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملAn Investigation on the Effects of Optimum Forming Parameters in Hydromechanical Deep Drawing Process Using the Genetic Algorithm
The present research work is concerned with the effects of optimum process variables in elevated temperature hydro-mechanical deep drawing of 5052 aluminum alloy. Punch-workpiece and die-workpiece friction coefficients together with the initial gap between the blank holder and matrix were considered as the process variables which, in optimization terminology, are called design parameters. Since...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011